János Pintz
János Pintz (December 20, 1950, Budapest)[1] is a Hungarian mathematician working in analytic number theory. He is a fellow of the Rényi Mathematical Institute and is also a member of the Hungarian Academy of Sciences.
Mathematical results
- With János Komlós and Endre Szemerédi disproved the Heilbronn conjecture.
- With Iwaniec he proved that for sufficiently large n there is a prime between n and n+n23/42.
- Pintz gave an effective upper bound for the first number for which the Mertens conjecture fails.
- He gave a O(x2/3) upper bound for the number of those numbers that are less than x and not the sum of two primes.
- With Imre Z. Ruzsa he improved a result of Linnik by showing that every sufficiently large even number is the sum of two primes and at most 8 powers of 2.
- Pintz is best known for the following result that he, Daniel Goldston, and Cem Yıldırım proved in 2005:[2]
where denotes the nth prime number. In other words, for every c > 0, there exist infinitely many pairs of consecutive primes pn and pn+1 that are closer to each other than the average distance between consecutive primes by a factor of c, i.e., pn+1 − pn < c log pn.
This result was originally reported in 2003 by Dan Goldston and Cem Yıldırım but was later retracted.[3][4] Then Janos Pintz joined the team and completed the proof in 2005. Later they improved this to showing that pn+1-pn<c√log n(log log n)2 occurs infinitely often.
Further, if one assumes the Elliott-Halberstam conjecture, then one can also show that primes within 16 of each other occur infinitely often, which is nearly the twin prime conjecture.
- Goldston, S. W. Graham, Pintz, and Yıldırım proved that the difference between numbers which are products of exactly 2 primes is infinitely often at most 6.[5]
See also
References
External links
Persondata |
Name |
Pintz, Janos |
Alternative names |
|
Short description |
|
Date of birth |
|
Place of birth |
|
Date of death |
|
Place of death |
|